Symbolic Partial Order Reduction for Rule Based Transition Systems
نویسندگان
چکیده
Partial order (PO) reduction methods are widely employed to combat state explosion during model-checking. We develop a partial order reduction algorithm for rule-based languages such as Murphi [4] based on the observation that for finite-state systems, independence conditions used for PO reduction can be encoded as boolean propositions and checked using SAT methods. Comparisons against static-analysis based PO reduction algorithms have yielded encouraging results.
منابع مشابه
A Symbolic Partial Order Reduction Algorithm for Rule Based Transition Systems
Partial order reductions are a class of methods that attempt to reduce the state space that must be explored to verify systems by explicit state enumeration. Partial order reduction algorithms have been successfully incorporated into tools such as Spin and VFSM-valid. However, current partial order algorithms assume that the concurrency model is based on processes. Rule based formalisms, such a...
متن کاملCav 1997 Submission: Category a Partial Order Reduction in Symbolic State Space Exploration
State space explosion is a fundamental obstacle in formal veriication of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are signiicant: symbolic state space search using BDDs and partial order reductions. In asynchronous systems, interleavings of independent concurrent events are equivalent, and only a representative inte...
متن کاملPartial-Order Reduction in Symbolic State Space Exploration
State space explosion is a fundamental obstacle in formal veri cation of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are signi cant: partialorder reductions and symbolic state space search. In asynchronous systems, interleavings of independent concurrent events are equivalent, and only a representative interleaving nee...
متن کاملCombining Partial Order Reduction with Bounded Model Checking
Model checking is an efficient technique for verifying properties on reactive systems. Partial-order reduction (POR) and symbolic model checking are two common approaches to deal with the state space explosion problem in model checking. Traditionally, symbolic model checking uses BDDs which can suffer from space blowup. More recently bounded model checking (BMC) using SAT-based procedures has b...
متن کاملTutorial: Software Model Checking
Model Checking is an automated technique for the systematic exploration ofu the state space of a state transition system. The first part of the tutorial provides an introduction to the basic concepts of model checking, including BDDand SAT-based symbolic model checking, partial order reduction, abstraction, and compositional verification. Model Checking has been applied sucessfully to hardware ...
متن کامل